Connected Baranyai’s theorem
نویسندگان
چکیده
منابع مشابه
A Chain Theorem for 3+-Connected Graphs
4 A 3-connected graph is 3-connected if it has no 3-separation that separates a “large” fan or K3,n 5 from the rest of the graph. It is proved in this paper that, except for K4, every 3 -connected graph has 6 a 3-connected proper minor that is at most two edges away from the original graph. This result is used 7 to characterize Q-minor-free graphs, where Q is obtained from the Cube by contracti...
متن کاملA chain theorem for 4-connected matroids
A matroid M is said to be k–connected up to separators of size l if whenever A is (k − 1)–separating in M , then either |A| ≤ l or |E(M)− A| ≤ l. We use si(M) and co(M) to denote the simplification and cosimplification of the matroid M . We prove that if a 3–connected matroid M is 4–connected up to separators of size 5, then there is an element x of M such that either co(M\x) or si(M/x) is 3–co...
متن کاملCobordism Theorem and Simply-Connected 3-Manifold
Every compact smooth simply connected 3-manifold is a twisted 3-sphere, so every smooth simply connected 3-manifold is diffeomorphic to S.
متن کاملTurán's theorem and k-connected graphs
The minimum size of a k-connected graph with given order and stability number is investigated. If no connectivity is required, the answer is given by Turán’s Theorem. For connected graphs, the problem has been solved recently independently by Christophe et al., and by Gitler and Valencia. In this paper, we give a short proof of their result and determine the extremal graphs. We settle the case ...
متن کاملA Coding Theorem Connected on R-Norm Entropy
A relation between Shannon entropy and Kerridge inaccuracy, which is known as Shannon inequality, is well known in information theory. In this communication, first we generalized Shannon inequality and then given its application in coding theory.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorica
سال: 2014
ISSN: 0209-9683,1439-6912
DOI: 10.1007/s00493-014-2928-3